Texture Adaptation for Progressive Meshes

نویسندگان

  • Chih-Chun Chen
  • Jung-Hong Chuang
چکیده

Level-of-detail modeling is a vital representation for real-time applications. To support texture mapping progressive meshes (PM), we usually allow the whole PM sequence to share a common texture map. Although such a common texture map can be derived by using appropriate mesh parameterizations that consider the minimization of geometry stretch, texture stretch, or even the texture deviation introduced by edge collapses, we have found that even with a well parameterized texture map, the texture mapped PM still reveals apparent texture distortion due to geometry changes and the nature of linear interpolation used by texture mapping hardware. In this paper, we propose a novel, simple, and efficient approach that adapts texture content for each edge collapse, aiming to eliminate texture distortion. A texture adaptation and its inverse are local and incremental operations that can be fully supported by texture mapping hardware, the render-to-texture feature, and the fragment shader. Once the necessary correspondence in the partition of texture space is built during the course of PM construction, the texture adaptation or its inverse can be applied on the fly before rendering the simplified or refined model with texture map. We also propose the mechanism of indexing mapping to reduce blurred artifacts due to under-sampling that might be introduced by texture adaptation.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Progressive compression of arbitrary textured meshes

In this paper, we present a progressive compression algorithm for textured surface meshes, which is able to handle polygonal non-manifold meshes as well as discontinuities in the texture mapping. Our method applies iterative batched simplifications, which create high quality levels of detail by preserving both the geometry and the texture mapping. The main features of our algorithm are (1) gene...

متن کامل

An Adaptive Framework for Static 3D Model with On-Demand Protocol

At present, we design a framework for streaming of 3D static model with rate adaptation techniques called TCP-Friendly Rate Adaptation. The 3D model in our framework is compressed with progressive meshes method [Hoppe96]. Exploited the dependency from progressive meshes, we transmit 3D model progressively.

متن کامل

Hierarchical Least Squares Conformal Map

A texture atlas is an efficient way to represent information (like colors, normals, displacement maps ...) on triangulated surfaces. The LSCM method (Least Squares Conformal Maps) automatically generates a texture atlas from a meshed model. For large charts (over 100k facets), the convergence of the numerical solver may be slow. It is well known that the conformality criterion, minimized by LSC...

متن کامل

Video Compression : Wavelet Based Coding and Texture Synthesis Based Coding

This report introduces the emerging Wavelet-based video coding system. Inefficiency of the block-based motion estimation in context of the wavelet coder is discussed in comparison to the mesh-based approach. A progressive mesh refinement technique using multiple layers is proposed also a fast motion estimation based on the redundant wavelet is presented that outperforms a full-search motion est...

متن کامل

Rate-Distortion Optimal Mesh Simplification for Communications

The thesis studies the optimization of a specific type of computer graphic representation: polygon-based, textured models. More precisely, we focus on meshes having 4-8 connectivity. We study a progressive and adaptive representation for textured 4-8 meshes suitable for transmission. Our results are valid for 4-8 meshes built from matrices of amplitudes, or given as approximations of a subdivis...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Comput. Graph. Forum

دوره 25  شماره 

صفحات  -

تاریخ انتشار 2006